Binary Codes with Inner
نویسنده
چکیده
In this paper synchronous DS-CDMA with binary block coding is investigated for AWGN. First the asymptotic behaviour for coded transmission is derived for the optimal decoder. This order is called the asymptotic distance. Upper and lower bounds for the asymptotic distance are given for a K user system. For K = 2 the asymptotic distance is calculated exactly.Then it is shown how the asymptotic behaviour depends on the codes of the users and how the codes have to be designed for good near-far resistance.
منابع مشابه
High Rate Binary Coset Code Used for Inner Code
High rate binary coset codes are investigated. The binary coset(BC) code is a binary convolutional code with parallel path. In our previous research of concatenated trelliscoded modulation(TCM) scheme, we have found that the e ective minimum distance of inner code is more important than the minimum free distance when TCM is used as inner code. In this paper, for inner code, we construct the hig...
متن کاملOn the error exponent for woven convolutional codes with inner warp
In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.
متن کاملInner Code Rate Selection for a Concatenated Coding
| Concatenated codes have long been used as a practical means of combating errors on very noisy channels. In this paper we investigate the performance of concatenated systems that employ inner convolutional codes with outer Reed-Solomon codes. We determine upper and lower bounds of the optimal inner code rate for a selected overall code rate on a binary symmetric channel .
متن کاملThe Capacity of Binary Channels that Use Linear Codes and Decoders
This paper analyzes the performance of concatenated coding systems operating over the binary-symmetric channel (BSC) by examining the loss of capacity resulting from each of the processing steps. The techniques described in this paper allow the separate evaluation of codes and decoders and thus the identification of where loss of capacity occurs. They are, moreover, very useful for the overall ...
متن کاملBinary multilevel convolutional codes with unequal error protection capabilities
Binary multilevel convolutional codes (CC’s) with unequal error protection (UEP) capabilities are studied. These codes belong to the class of generalized concatenated (GC) codes [1]. Binary CC’s are used as outer codes. Binary linear block codes of short length, and selected subcodes in their two-way subcode partition chain, are used as inner codes. Multistage decodings are presented that use V...
متن کاملLecture 10 : Justesen Codes and Reed - Solomon Decoding 1 November 2006
Up until now, we have seen bounds that tell us good codes should be possible but we didn’t know how to construct such codes explicitly. The binary Reed-Solomon code gave us good rate but poor distance. Intuitively, we should be able to concatenate it with an inner code that would “amplify” its distance. Enumerating and searching codes takes O(2) time, so we can’t just find one good inner code a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997